Search Space and Average Proof Length of Resolution
نویسندگان
چکیده
In this paper we introduce a deenition of search trees for resolution based proof procedures. This deenition describes more clearly the diierences between the restrictions of resolution. Applying this concept to monotone restrictions of the resolution it is shown that the average proof length for propositional formulas is at most four times as large as for unrestricted resolution. The search trees used within this paper also allow the representation of space bounded resolution.
منابع مشابه
A Space Hierarchy for k-DNF Resolution
The k-DNF resolution proof systems are a family of systems indexed by the integer k, where the k member is restricted to operating with formulas in disjunctive normal form with all terms of bounded arity k (k-DNF formulas). This family was introduced in [Krajı́ček 2001] as an extension of the wellstudied resolution proof system. A number of lower bounds have been proven on k-DNF resolution proof...
متن کاملTo Express Required CT-Scan Resolution for Porosity and Saturation Calculations in Terms of Average Grain Sizes
Despite advancements in specifying 3D internal microstructure of reservoir rocks, identifying some sensitive phenomenons are still problematic particularly due to image resolution limitation. Discretization study on such CT-scan data always has encountered with such conflicts that the original data do not fully describe the real porous media. As an alternative attractive approach, one can recon...
متن کاملSpace in Proof Complexity
Propositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter. There are different approaches to reasoning that are captured by corresponding proof systems, each with its own strengths and weaknesses and need for resources. The simplest an...
متن کاملRelating Proof Complexity Measures and Practical Hardness of SAT
Boolean satisfiability (SAT) solvers have improved enormously in performance over the last 10–15 years and are today an indispensable tool for solving a wide range of computational problems. However, our understanding of what makes SAT instances hard or easy in practice is still quite limited. A recent line of research in proof complexity has studied theoretical complexity measures such as leng...
متن کاملA simplified way of proving trade-off results for resolution
We present a greatly simplified proof of the length-space trade-off result for resolution in Hertel and Pitassi (2007), and also prove a couple of other theorems in the same vein. We point out two important ingredients needed for our proofs to work, and discuss possible conclusions to be drawn regarding proving trade-off results for resolution. Our key trick is to look at formulas of the type F...
متن کامل